Structuredquasi - cyclicLDPCcodeswith girth 18 and column - weight J 3

نویسندگان

  • M. Esmaeili
  • M. Gholami
چکیده

A class of maximum-girth geometrically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes with columnweight J 3 is presented. The method is based on the slope concept between two circulant permutation matrices and the concept of slope matrices. A LDPC code presented by a mv ×ml parity-check matrix H , consisting of m ×m matrices each of which is either a circulant permutation matrix or a matrix with no nonzero entry, is called a m-circulant vm × lm LDPC code, or just a m-circulant LDPC code. Let D be a (v, J ) configuration; that is it has v points, its blocks are of size J , and any two points are contained by at most one block. A m-circulant LDPC code with a mv × ml parity-check matrix H is called a configuration-based code if the set P = {1, 2, . . . , v} together with B = {B1, B2, . . . , Bl} is a configuration where Bi is the subset of P specifying the set of nonzero block positions of the i th block-column of H . Let S = (si, j )v×v be a matrix over Zm . Under a certain condition, the matrix S is called a m-slope-matrix (m-SM) over a given (v, J ) configuration D. To any m-SM S over a (v, J ) configuration D, with l blocks, a D-based m-circulant vm × lm LDPC code, referred to as a slope matrix (SM) code, is associated. It is shown that themaximumgirth achieved by SM codes over a large class of configurations, including any balanced incomplete block design, is 18. A low-complexity algorithm producing such LDPC codes with girth 6 g 18 is given. As a few examples, a set of SM codes based on the Steiner triple systems STS(9) and STS(13), the 15-points 3× 5 integer lattice, denoted L(3× 5), and a 12-points configuration, denoted Aff∗(16), obtained from the 16-points affine plane Aff(16) are constructed. These codes have rates at least 0.25, 0.5, 0.4 and 0.37, respectively. From performance perspective, the constructed codes with girth g 14 and length from 34,000 to 92,000 bits and the mentioned rates outperform the random-like LDPC codes of the same lengths and rates, and have a waterfall at about 10−6 BER and 1.5dB of Eb/N0. 2009 Elsevier GmbH. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Column Weight Two and Three LDPC Codes with High Rates and Large Girths

In this paper, the concept of the broken diagonal pair in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle codes with girth 12. Interestingly, the constructed regular cycle codes with row-weights t, 3 ≤ t ≤ 20, t 6= 7, 15, 16, have the best lengths among the known regu...

متن کامل

High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs

LDPC codes of columnweight of two are constructed fromminimal distance graphs or cages. Distance graphs are used to represent LDPC code matrices such that graph vertices that represent rows and edges are columns. The conversion of a distance graph into matrix form produces an adjacency matrix with column weight of two and girth double that of the graph. The number of 1’s in each row (row weight...

متن کامل

Large-Girth Column-Weight Two QC-LDPC Codes

This article presents a method for constructing large girth column-weight 2 QC-LDPC codes. A distance graph is first constructed using an existing method. The distance graph is then converted into a Tanner graph. The proposed method could easily construct codes with girths large than 12 and is more flexible compared to previous methods. Obtained codes show good bit error rate performance compar...

متن کامل

Error Correction Capability of Column-Weight-Three LDPC Codes: Part II

The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct g/2 − 1 errors in g/2 iterations on a Tanner graph of girth g ≥ 10.

متن کامل

Analytical lower bounds for the size of elementary trapping sets of variable-regular LDPC codes with any girth and irregular ones with girth 8

In this paper we give lower bounds on the size of (a, b) elementary trapping sets (ETSs) belonging to variable-regular LDPC codes with any girth, g, and irregular ones with girth 8, where a is the size, b is the number of degree-one check nodes and satisfy the inequality b a < 1. Our proposed lower bounds are analytical, rather than exhaustive search-based, and based on graph theories. The nume...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009